Best, worst and average case

Results: 52



#Item
11Analysis of algorithms / Computational complexity theory / Best /  worst and average case / Time complexity / Algorithm / Fast Fourier transform / Big O notation / Average-case complexity / Sorting algorithm

Computing Fundamentals Salvatore Filippone 2012–2013

Add to Reading List

Source URL: people.uniroma2.it

Language: English - Date: 2014-09-23 08:12:56
12Computational complexity theory / Analysis of algorithms / Best /  worst and average case / Time complexity / Algorithm / Fast Fourier transform / Big O notation / Average-case complexity / Sorting algorithm

Computing Fundamentals Salvatore Filippone 2013–2014

Add to Reading List

Source URL: people.uniroma2.it

Language: English - Date: 2014-09-23 08:13:16
13Fault-tolerant computer systems / Distributed algorithms / Paxos / Consensus / Raft / Replication / Distributed computing / Leader election / Extensible Storage Engine / Best /  worst and average case / Server

In Search of an Understandable Consensus Algorithm

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English
14Analysis of algorithms / Time complexity / Sorting algorithm / Algorithm / Randomized algorithm / NC / Big O notation / Best /  worst and average case / B-tree / Soft heap / Oblivious data structure

Fault Tolerant External Memory Algorithms Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1,? , and Thomas Mølhave1,? BRICS, MADALGO?? , Department of Computer Science, Aarhus University, Denmark. {gerth,jallan,thom

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2015-07-24 06:57:56
15Real-time computing / Worst-case execution time / Actuarial science / Analysis of algorithms / Parallel computing / Best /  worst and average case / Reliability engineering / Copula / Embedded system / Protection ring / Probability distribution / Value at risk

Predictability as an Emergent Behaviour Alan Burns and David Griffin Department of Computer Science, University of York, UK. email {burns, djg}@cs.york.ac.uk Abstract—One means of obtaining time predicable systems is

Add to Reading List

Source URL: www-users.cs.york.ac.uk

Language: English - Date: 2012-01-30 09:43:45
16Analysis of algorithms / Computational complexity theory / Susanne Albers / Software optimization / Cache / Dagstuhl / Best /  worst and average case / Algorithm / Analysis / Locality of reference / Computational geometry / Paging

Modeling Real-World Data Sets Susanne Albers Department of Computer Science, Technische Universität München Boltzmannstr. 3, 85748 Garching, Germany

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-06-11 03:07:17
17Fault-tolerant computer systems / Distributed algorithms / Analysis of algorithms / Data synchronization / Paxos / Consensus / Replication / Raft / Distributed computing / Extensible Storage Engine / Leader election / Best /  worst and average case

In Search of an Understandable Consensus Algorithm (Extended Version) Diego Ongaro and John Ousterhout Stanford University Abstract

Add to Reading List

Source URL: ongardie.net

Language: English - Date: 2014-10-23 02:16:26
18Analysis of algorithms / Sorting algorithms / Computational complexity theory / Permutations / Quicksort / Science / Selection algorithm / FisherYates shuffle / Algorithm / Time complexity / Sort / Best /  worst and average case

Sorting and Selection on Dynamic Data∗ Aris Anagnostopoulos† Ravi Kumar‡ Mohammad Mahdian‡

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
19Computational complexity theory / Analysis of algorithms / Operations research / Linear programming / Convex optimization / Algorithm / Smoothed analysis / Best /  worst and average case / Time complexity / Sorting algorithm / Merge sort / Simplex algorithm

CS264: Beyond Worst-Case Analysis Lecture #1: Three Motivating Examples∗ Tim Roughgarden† September 22,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-02 12:29:21
20Analysis of algorithms / Balls into bins / With high probability / Sorting algorithm / Leader election / Time complexity / Best /  worst and average case / Big O notation / Bin / Iterated logarithm / Randomized algorithm / Asymptotically optimal algorithm

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:02
UPDATE